Distance between Attributed Graphs and Function-Described Graphs Relaxing 2nd Order Restrictions
نویسندگان
چکیده
Function-Described Graphs (FDGs) have been introduced as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition and a distance measure using restrictions between AGs and FDGs has been reported. Nevertheless, in real applications, AGs can be distorted by some external noise, and therefore some constraints have to be relaxed. To gain more flexibility and robustness, some local costs may be added to the global cost of the labelling depending on the fulfilment of the graph element constraints of the FDG instead of applying hard binary constraints.
منابع مشابه
Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملSecond-Order Random Graphs For Modeling Sets Of Attributed Graphs And Their Application To Object Learning And Recognition
The aim of this article is to present a random graph representation, that is based on 2 order relations between graph elements, for modeling sets of attributed graphs (AGs). We refer to these models as second-order random graphs (SORGs). The basic feature of SORGs is that they include both marginal probability functions of graph elements and 2order joint probability functions. This allows a mor...
متن کاملReciprocal Degree Distance of Grassmann Graphs
Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.
متن کاملClustering of Attributed Graphs and Unsupervised Synthesis of Function-Described Graphs
Function-Described Graphs (FDGs) have been introduced by the authors as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition alternative to first-order random graphs. Both optimal and approximate algorithms for error-tolerant graph matching, which use a distance measure between AGs and FDGs, have been reported elsewhere. Also, the supervised synthesis of...
متن کاملEfficient Algorithms for Matching Attributed Graphs and Function-Described Graphs
Function-Described Graphs (FDGs) have been introduced by the authors as a representation of an ensemble of Attributed Graphs (AGs) for structural pattern recognition alternative to first-order random graphs. In previous works, algorithms for the synthesis of FDGs and a branch-and-bound algorithm for errortolerant graph matching, which computes a distance measure between AGs and FDG, have been r...
متن کامل